An Efficient Heuristic Search in a Large Multi-Agent System
نویسندگان
چکیده
We are investigating the cooperative behavior of intelligent agents in a large group. A cooperative intelligent agent is a user's personal consultant that can take care of problems the user got, and solve them either by itself or via cooperation. We have proposed a twin-base (cooperator-base U task-base) agent modeling technique for individual agents to monitor activities of the others in order to achieve e cient cooperation in a small agent group (Cao, Bian, & Hartvigsen 1996) (Cao, Bian, & Hartvigsen 1997a). While the group grows in size and complexity, an activity-oriented hierarchical organization structure, club-community-society, has been studied (Cao, Bian, & Hartvigsen 1997b). In this organization, each agent shows its activities to the outside world, and these activities are symbolic categories for the twin-base guided heuristic searches in peer locating processes.
منابع مشابه
A multi Agent System Based on Modified Shifting Bottleneck and Search Techniques for Job Shop Scheduling Problems
This paper presents a multi agent system for the job shop scheduling problems. The proposed system consists of initial scheduling agent, search agents, and schedule management agent. In initial scheduling agent, a modified Shifting Bottleneck is proposed. That is, an effective heuristic approach and can generate a good solution in a low computational effort. In search agents, a hybrid search ap...
متن کاملA heuristic approach for multi-stage sequence-dependent group scheduling problems
We present several heuristic algorithms based on tabu search for solving the multi-stage sequence-dependent group scheduling (SDGS) problem by considering minimization of makespan as the criterion. As the problem is recognized to be strongly NP-hard, several meta (tabu) search-based solution algorithms are developed to efficiently solve industry-size problem instances. Also, two different initi...
متن کاملCONFIGURATION OPTIMIZATION OF TRUSSES USING A MULTI HEURISTIC BASED SEARCH METHOD
Different methods are available for simultaneous optimization of cross-section, topology and geometry of truss structures. Since the search space for this problem is very large, the probability of falling in local optimum is considerably high. On the other hand, different types of design variables (continuous and discrete) lead to some difficulties in the process of optimization. In this articl...
متن کاملOPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING MODIFIED CHARGED SYSTEM SEARCH
Optimal design of large-scale structures is a rather difficult task and the computational efficiency of the currently available methods needs to be improved. In view of this, the paper presents a modified Charged System Search (CSS) algorithm. The new methodology is based on the combination of CSS and Particle Swarm Optimizer. In addition, in order to improve optimization search, the sequence o...
متن کاملSolving multi-objective team orienteering problem with time windows using adjustment iterated local search
One of the problems tourism faces is how to make itineraries more effective and efficient. This research has solved the routing problem with the objective of maximizing the score and minimizing the time needed for the tourist’s itinerary. Maximizing the score means collecting a maximum of various kinds of score from each destination that is visited. The profits differ according to whether those...
متن کاملConsidering Production Planning in the Multi-period Inventory Routing Problem with Transshipment between Retailers
Generally, the inventory routing problem occurs in a supply chain where customers consider the supplier responsible for inventory replenishment. In this situation, the supplier finds the answer to questions regarding the time and quantity of delivery to the customer as well as the sequence of customers in the routes. Considering the effect of production decisions on answering these questions, t...
متن کامل